Ranking as parameter estimation
نویسندگان
چکیده
Ranking of alternatives is a common, difficult and repeatedly addressed problem, especially when it requires negotiation of experts. The celebrated Arrow’s impossibility theorem expresses formally its difficulty. In spite of theprogressmadebyadopting soft ranking, the problem is far from being generically solved. The paper provides a, probably novel, problem formulation by viewing ranking of alternatives as an estimation of an unknown objective ranking vector. The idea is exposed on a specific task of ranking quality of projects by a large group of experts. The task is important on its own but the proposed methodology is the main message worth of generalisation and use in other application domains.
منابع مشابه
Estimation of a Linear Model under Microaggregation by Individual Ranking
Microaggregation by individual ranking is one of the most commonly applied disclosure control techniques for continuous microdata. The paper studies the effect of microaggregation by individual ranking on the least squares estimation of a multiple linear regression model in continuous variables. It is shown that the naive parameter estimates are asymptotically unbiased. Moreover, the naive leas...
متن کاملwww.econstor.eu Estimation of a Linear Model under Microaggregation by Individual Ranking
Microaggregation by individual ranking is one of the most commonly applied disclosure control techniques for continuous microdata. The paper studies the effect of microaggregation by individual ranking on the least squares estimation of a multiple linear regression model in continuous variables. It is shown that the naive parameter estimates are asymptotically unbiased. Moreover, the naive leas...
متن کاملMixtures of weighted distance-based models for ranking data with applications in political studies
Analysis of ranking data is often required in various fields of study, for example politics, market research and psychology. Over the years, many statistical models for ranking data have been developed. Among them, distance-based ranking models postulate that the probability of observing a ranking of items depends on the distance between the observed ranking and a modal ranking. The closer to t...
متن کاملParameter Estimation of Some Archimedean Copulas Based on Minimum Cramér-von-Mises Distance
The purpose of this paper is to introduce a new estimation method for estimating the Archimedean copula dependence parameter in the non-parametric setting. The estimation of the dependence parameter has been selected as the value that minimizes the Cramér-von-Mises distance which measures the distance between Empirical Bernstein Kendall distribution function and true Kendall distribution functi...
متن کاملImproving Ranking Using Quantum Probability
Data management systems, like database, information extraction, information retrieval or learning systems, store, organize, index, retrieve and rank information units, such as tuples, objects, documents, items to match a pattern (e.g. classes and profiles) or meet a requirement (e.g., relevance, usefulness and utility). To this end, these systems rank information units by probability to decide ...
متن کامل